#pragma once

#include  "iostream"
#include  "vector"
#include  "stack"
#include  "unordered_map"
#include   "deque"

using namespace std;

///简单题这个抄的
bool repeatedSubstringPattern(string s) {
    //方法 s+s =ss 然后去除头和尾部一个字符 判断这个字符串是否包含s
    string res = s + s;
    res.pop_back();
    res.erase(res.begin());
    auto resutt = res.find(move(s));
    return resutt != string::npos;
}